On the Trifference Problem for Linear Codes
نویسندگان
چکیده
We prove that for $n$ sufficiently large, all perfect 3-hash linear codes in notation="LaTeX">$\mathbb {F}_{3}^{n}$ must have dimension at most notation="LaTeX">$\left ({\frac {1}{4}-\epsilon }\right)n$ some absolute constant notation="LaTeX">$\epsilon > 0$ .
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملNew Bounds on a Hypercube Coloring Problem and Linear Codes
In studying the scalability of optical networks, one problem arising involves coloring the vertices of the dimensional hypercube with as few colors as possible such that any two vertices whose Hamming distance is at most are colored differently. Determining the exact value of , the minimum number of colors needed, appears to be a difficult problem. In this paper, we improve the known lower and ...
متن کاملon the goursat problem for a linear partial differential equation
in this paper, the goursat problem of a general form for a linear partial differential equation is investigated with the help of the riemann function method. some results are given concerning the existence and uniqueness for the solution of the suggested problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2022.3183619